Fourier-Motzkin Elimination and Its Dual
نویسندگان
چکیده
منابع مشابه
Strong Duality and Dual Pricing Properties in Semi-Infinite Linear Programming: A non-Fourier-Motzkin Elimination Approach
The Fourier-Motzkin elimination method has been recently extended to linear inequality systems that have infinitely many inequalities. It has been used in the study of linear semi-infinite programming by Basu, Martin, and Ryan. Following the idea of the conjecture for semi-infinite programming in a paper by Kortanek and Zhang recently published in Optimization, which states “all the duality res...
متن کاملThe dependency diagram of a linear programme
The Dependency Diagram of a Linear Programme (LP) shows how the successive inequalities of an LP depend on former inequalities, when variables are projected out by Fourier-Motzkin Elimination. It is also explained how redundant inequalities can be removed, using the method attributed to Chernikov and to Kohler. The procedure also leads to a transparent explanation of FarkasLemma, LP Duality, t...
متن کاملProjection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. Weextend Fourier-Motzkin elimination to semi-infinite linear programs which are linear programswith finitely many variables and infinitely many constraints. Applying projection leads to newcharacterizations of important properties for primal-dual pairs of semi-infinite programs suchas zero ...
متن کاملA new framework for the solution of DEA models
We provide an alternative framework for solving Data Envelopment Analysis (DEA) models which, in comparison with the standard Linear Programming (LP) based approach that solves one LP for each Decision Making Unit (DMU), delivers much more information. By projecting out all the variables which are common to all LP runs, we obtain a formula into which we can substitute the inputs and outputs of ...
متن کاملParallel Fourier-Motzkin Elimination
Fourier{Motzkin elimination is a computationally expensive but powerful method to solve a system of linear inequalities for real and integer solution spaces. Because it yields an explicit representation of the solution set, in contrast to other methods such as Simplex, one may, in some cases, take its longer run time into account. We show in this paper that it is possible to considerably speed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 14 شماره
صفحات -
تاریخ انتشار 1973